| 翻訳と辞書 |
| Hub (network science concept) ： ウィキペディア英語版 |
Hub (network science concept)
Hub is a concept in network science which refers to a node with a number of links that greatly exceeds the average. Emergence of hubs is a consequence of a scale-free property of networks.〔(Barabási, Albert-László. ''Network Science: Graph Theory''., p. 27 )〕 While hubs cannot be observed in a random network, they are expected to emerge in scale- free networks. Uprise of hubs in scale-free networks is associated with power- law distribution. Hubs have a significant impact on the network topology. Hubs can be found in many real networks, such as Brain Network or Internet.
== Definition ==
Hub is a component of a network, a high- degree node. It refers to a node that has significantly bigger number of links in comparison with other nodes in the network. Number of links (degrees) for hub in a scale-free network is much higher than the biggest node in a random network would have, keeping the size ''N'' of the network and average degree '''' constant. Existence of hubs is the biggest difference between random networks and scale-free networks. In random networks the number of degrees ''k'' is comparable for every node and therefore it is not possible for hubs to emerge. In scale-free networks a few nodes (hubs) have a high degree ''k'' while the rest of the nodes has a small number of links.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Hub (network science concept)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|